Hypergraph Partitioning-based Fill-reducing Ordering

A typical first step of a direct solver for linear system Mx = b is reordering of symmetric matrix M to improve execution time and space requirements of the solution process. In this work, we propose a novel nesteddissection-based ordering approach that utilizes hypergraph partitioning. Our approach is based on formulation of graph partitioning by vertex separator (GPVS) problem as a hypergraph partitioning problem. This new formulation is immune to deficiency of GPVS in a multilevel framework hence enables better orderings. In matrix terms, our method relies on the existence of a structural factorization of the input M matrix in the form of M = AAT (or M = AD2AT ). We show that the partitioning of the row-net hypergraph representation of rectangular matrix A induces a GPVS of the standard graph representation of matrix M . In the absence of such factorization, we also propose simple, yet effective structural factorization techniques that are based on finding an edge clique cover of the standard graph representation of matrix M , and hence applicable to any arbitrary symmetric matrix M . Our experimental evaluation has shown that the proposed method achieves better ordering in comparison to state-ofthe-art graph-based ordering tools even for symmetric matrices where structural M = AAT factorization is not provided as an input. For matrices coming from linear programming problems, our method enables even faster and better orderings.